Horizontal partitioning method for test verification in parallel database systems

نویسنده

  • Feras Hanandeh
چکیده

In parallel database systems the partitioning methods considered in current researches are static. This research paper presents a partitioning method to divide the database relations into dynamic horizontal partitions. Every partition contains some tuples of the database relation. These partitions will be checked using the subsets generated from the integrity constraints during the test verification process. Furthermore, the integrity of these partitions will be enforced by the generated integrity rules. It presents the algorithm of distributing the integrity test(s) among the horizontal partitions. As our intention is to parallelise the execution of the integrity tests, the relations specified in the test are dynamically partitioned into several parts based on the number of available processors. Each processor checks the validity of the test concurrently by accessing the partition assigned to it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new algorithm for identity verification based on the analysis of a handwritten dynamic signature

Identity verification based on authenticity assessment of a handwritten signature is an important issue in biometrics. There are many effective methods for signature verification taking into account dynamics of a signing process. Methods based on partitioning take a very important place among them. In this paper we propose a new approach to signature partitioning. Its most important feature is ...

متن کامل

A Trust Based Probabilistic Method for Efficient Correctness Verification in Database Outsourcing

Correctness verification of query results is a significant challenge in database outsourcing. Most of the proposed approaches impose high overhead, which makes them impractical in real scenarios. Probabilistic approaches are proposed in order to reduce the computation overhead pertaining to the verification process. In this paper, we use the notion of trust as the basis of our probabilistic app...

متن کامل

Bitmap Join Indexes vs. Data Partitioning

IntroductIon Scientific databases and data warehouses store large amounts of data ith several tables and attributes. For instance, the Sloan Digital Sky Survey (SDSS) astronomical database contains a large number of tables with hundreds of attributes, which can be queried in various combinations (Papadomanolakis & Ailamaki, 2004). These queries involve many tables using binary operations, such ...

متن کامل

Experience Report: Exploiting Advanced Database Optimization Features for Large-Scale SAP R/3 Installations

The database volumes of enterprise resource planning (ERP) systems like SAP R/3 are growing at a tremendous rate and some of them have already reached a size of several Terabytes. OLTP (Online Transaction Processing) databases of this size are hard to maintain and tend to perform poorly. Therefore most database vendors have implemented new features like horizontal partitioning to optimize such ...

متن کامل

Method Transformations for Vertical Partitioning in Parallel and Distributed Object Databases

Vertical partitioning is a useful technique for performance improvement in parallel and distributed object oriented database systems (POBSs and DOBSs). Arising from partitioning, there is a need to modify methods in a user deened schema for correct execution in the partitioned domain. A partitioning scheme should also support application transparency in order to make schema deenitions and verti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJAIP

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2017